Providing search query results based on entity variant generation and normalization

ABSTRACT

Search results are provided for a search query. A search query including an entity and entity type is received. The entity is parsed into semantic components. Variants are generated based on input from auxiliary information and user configuration information for each of the semantic components. The entity is recomposed in different morphological forms from different variants of the semantic components. At least one morphological form for the entity is presented as a search result.

BACKGROUND

Typically identification of an entity can be presented in differentlinguistic forms. For example, the company “International BusinessMachines Corporation” is typically referred to as “IBM Corporation” orsimply “IBM.” The existence of different morphological forms for thesame entity can occur in queries or in documents and poses greatchallenges for search engines both at the search phase and at the resultpresentation phase.

At the search phase, a query posed by the user to search for an entityin an information retrieval system may be different from how that entityis described/identified in the underlying data. For example, when theuser searches for the person “Fred Doe”, the name of that person inunderlying data may be “Frederick Doe.” As such, the search engine needsto recognize that “Frederick Doe” is a good match for “Fred Doe” inorder to provide the right results back to the user. Otherwise, thesearch engine may return less relevant results to the user.

SUMMARY

Embodiments of the invention relate to entity variant generation andnormalization. In one embodiment, determining variants of a text entitycomprises parsing the text entity into semantic components andgenerating variants for each of the semantic components. The entity isrecomposed in different morphological forms from the different variantsof the semantic components.

These and other aspects, features and advantages of the invention willbe understood with reference to the drawing figures, and detaileddescription herein, and will be realized by means of the variouselements and combinations particularly pointed out in the appendedclaims. It is to be understood that both the foregoing generaldescription and the following brief description of the drawings anddetailed description of the invention are exemplary and explanatory ofpreferred embodiments of the invention, and are not restrictive of theinvention, as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter which is regarded as the invention is particularlypointed out and distinctly claimed in the claims at the conclusion ofthe specification. The foregoing and other objects, features, andadvantages of the invention are apparent from the following detaileddescription taken in conjunction with the accompanying drawings inwhich:

FIG. 1 is a block diagram illustrating an example of a networkenvironment for entity variant generation and normalization, accordingto an embodiment of the present invention;

FIG. 2 is a block diagram illustrating an example of a server includinga system utilizing entity variant generation and normalization,according to an embodiment of the present invention, as shown in FIG. 1;

FIG. 3 shows a block diagram of an entity variant generation andnormalization system, according to an embodiment of the presentinvention;

FIG. 4 shows a process for entity variant generation, according to anembodiment of the present invention; and

FIG. 5 shows a process for entity variant generation and normalization.

DETAILED DESCRIPTION

The present invention may be understood more readily by reference to thefollowing detailed description of the invention taken in connection withthe accompanying drawing figures, which form a part of this disclosure.It is to be understood that this invention is not limited to thespecific devices, methods, conditions or parameters described and/orshown herein, and that the terminology used herein is for the purpose ofdescribing particular embodiments by way of example only and is notintended to be limiting of the claimed invention. One or more exemplaryembodiments of the invention are described below in detail. Thedisclosed embodiments are intended to be illustrative only sincenumerous modifications and variations therein will be apparent to thoseof ordinary skill in the art.

Embodiments of the invention relate to entity variant generation andnormalization. In one embodiment, the invention provides knowledge-richintelligent programmable entity variant generation and normalization,for querying information in an information retrieval system such as asearch engine in an information technology environment. An example querycomprises text such as one or more alphanumeric letters and/or words.

An identification of an entity is parsed into semantic components basedon the type of the entity and optionally auxiliary information. Variantsare generated for each of the semantic components and recomposed backinto different morphological forms or normalization form of the originalentity based on user programming/configuration and auxiliaryinformation.

Referring now to the drawings, FIG. 1 illustrates an example of thebasic components of an information technology system 10 utilizing anentity variant generation and normalization system 100 that implementsan entity variant generation and normalization for information retrievalusing search queries, according to an embodiment of the presentinvention. The information technology system 10 includes a server 11 andremote devices 15 and 17-20 that may utilize the system 100 of thepresent invention. In one embodiment, the server 11 implements aninformation retrieval system 5 (FIG. 2) that utilizes the system 100 ofthe present invention.

Each of the remote devices 15 and 17-20 has applications and can have alocal database 16. Server 11 contains applications, and is connected toa database 12 that can be accessed by remote devices 15 and 17-20 viaconnections 14(A-F), respectively, over a network 13. The server 11executes software for a computer network and controls access to itselfand database 12. The remote devices 15 and 17-20 may access the database12 over the network 13, such as but not limited to: the Internet, alocal area network (LAN), a wide area network (WAN), via a telephoneline using a modem (POTS), Bluetooth, WiFi, WiMAX, cellular, optical,satellite, radio frequency (RF), Ethernet, magnetic induction, coax,RS-485, the like, or other like networks. The server 11 may also beconnected to the local area network (LAN) within an organization.

The remote devices 15 and 17-20 may each be located at remote sites.Remote devices 15 and 17-20 include but are not limited to, PCs,workstations, laptops, handheld computers, pocket PCs, PDAs, pagers, WAPdevices, non-WAP devices, cell phones, palm devices, printing devicesand the like. Included with each remote device 15 and 17-20 is anability to request relevant material from a large collection ofdocuments via search queries to the server 11. Thus, when a user at oneof the remote devices 15 and 17-20 desires to access the system 100 andthe database 12 at the server 11, the remote device 15 and 17-20communicates over the network 13, to access the system 100, the server11 and database 12.

Third party computer systems 21 and database 22 can be accessed by theserver 11 in order to provide access to additional collections ofdocuments and/or search indexes. Data that is obtained from third partycomputer systems 21 and database 22 can be stored on server 11 anddatabase 12 in order to provide later access to the user on remotedevices 15 and 17-20. It is also contemplated that for certain types ofdata that the remote devices 15 and 17-20 can access the third partycomputer systems 21 and database 22 directly using the network 13.

The system 100 utilizes said an entity variant generation andnormalization process, according to an embodiment of the invention.Illustrated in FIG. 2 is a block diagram demonstrating an example ofserver 11, as shown in FIG. 1, utilizing the system 100 according to anembodiment of the present invention. The server 11 includes, but is notlimited to, PCs, workstations, laptops, PDAs, palm devices and the like.The processing components of the third party computer systems aresimilar to that of the description for the server 11 (FIG. 2).

Generally, in terms of hardware architecture, as shown in FIG. 2, theserver 11 includes a processor 41, a computer readable medium such asmemory 42, and one or more input and/or output (I/O) devices (orperipherals) that are communicatively coupled via a local interface 43.The local interface 43 can be, for example but not limited to, one ormore buses or other wired or wireless connections, as is known in theart. The local interface 43 may have additional elements, which areomitted for simplicity, such as controllers, buffers (caches), drivers,repeaters, and receivers, to enable communications. Further, the localinterface 43 may include address, control, and/or data connections toenable appropriate communications among the aforementioned components.

The processor 41 is a hardware device for executing software that can bestored in memory 42. The processor 41 can be virtually any custom madeor commercially available processor, a central processing unit (CPU),data signal processor (DSP) or an auxiliary processor among severalprocessors associated with the server 11, and a semiconductor basedmicroprocessor (in the form of a microchip) or a microprocessor.

The memory 42 can include any one or combination of volatile memoryelements (e.g., random access memory (RAM), such as dynamic randomaccess memory (DRAM), static random access memory (SRAM), etc.) andnonvolatile memory elements (e.g., read only memory (ROM), erasableprogrammable read only memory (EPROM), electronically erasableprogrammable read only memory (EEPROM), programmable read only memory(PROM), tape, compact disc read only memory (CD-ROM), disk, diskette,cartridge, cassette or the like, etc.). Moreover, the memory 42 mayincorporate electronic, magnetic, optical, and/or other types of storagemedia. Note that the memory 42 can have a distributed architecture,where various components are situated remote from one another, but canbe accessed by the processor 41.

The software in memory 42 may include one or more separate programs,each of which comprises an ordered listing of executable instructionsfor implementing logical functions. In the example illustrated in FIG.2, the software in the memory 42 includes a suitable operating system(O/S) 51 and the search system 100 of the present invention. The system100 comprises functional components and process blocks described furtherbelow.

The operating system 51 essentially controls the execution of othercomputer programs, such as the system 100, and provides scheduling,input/output control, file and data management, memory management, andcommunication control and related services. However, the system 100 ofthe present invention is applicable on all other commercially availableoperating systems.

The system 100 may comprise a source program, executable program (objectcode), script, or any other entity comprising a set of computer programinstructions to be performed. When the system 100 is a source program,then the program is usually translated via a compiler, assembler,interpreter, or the like, which may or may not be included within thememory 42, so as to operate properly in connection with the O/S 51.Furthermore, the system 100 can be written as (a) an object orientedprogramming language, which has classes of data and methods, or (b) aprocedure programming language, which has routines, subroutines, and/orfunctions. The computer program instructions may execute entirely onserver 11, partly on server 11, as a stand-alone software package,partly on server 11 and partly on a remote computer or entirely on theremote computer or server. In the latter scenario, the remote computermay be connected to the user's computer through any type of network,including a local area network (LAN) or a wide area network (WAN), orthe connection may be made to an external computer (for example, throughthe Internet using an Internet Service Provider).

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The I/O devices may include input devices, for example but not limitedto, a mouse 44, keyboard 45, scanner (not shown), microphone (notshown), etc. Furthermore, the I/O devices may also include outputdevices, for example but not limited to, a printer (not shown), display46, etc. Finally, the I/O devices may further include devices thatcommunicate both inputs and outputs, for instance but not limited to, aNIC or modulator/demodulator 47 (for accessing remote devices, otherfiles, devices, systems, or a network), a RF or other transceiver (notshown), a telephonic interface (not shown), a bridge (not shown), arouter (not shown), etc.

If the server 11 is a PC, workstation, intelligent device or the like,the software in the memory 42 may further include a basic input outputsystem (BIOS) (omitted for simplicity). The BIOS is a set of essentialsoftware routines that initialize and test hardware at startup, startthe O/S 51, and support the transfer of data among the hardware devices.The BIOS is stored in some type of read-only-memory, such as ROM, PROM,EPROM, EEPROM or the like, so that the BIOS can be executed when theserver 11 is activated.

When the server 11 is in operation, the processor 41 is configured toexecute software stored within the memory 42, to communicate data to andfrom the memory 42, and generally to control operations of the server 11pursuant to the software. The system 100 and the O/S 51 are read, inwhole or in part, by the processor 41, perhaps buffered within theprocessor 41, and then executed.

When the system 100 is implemented in software, as is shown in FIG. 2,it should be noted that the system 100 can be embodied in anycomputer-readable medium for use by or in connection with an instructionexecution system, apparatus, or device, such as a computer-based system,processor-containing system, or other system that can fetch theinstructions from the instruction execution system, apparatus, or deviceand execute the instructions.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

In the context of this document, a “computer-readable medium” can be anymeans that can store, communicate, propagate, or transport the programfor use by or in connection with the instruction execution system,apparatus, or device. The computer readable medium can be, for examplebut not limited to, an electronic, magnetic, optical, electromagnetic,infrared, or semiconductor system, apparatus, device, propagationmedium, or other physical device or means that can contain or store acomputer program for use by or in connection with a computer relatedsystem or method.

More specific examples (a non-exhaustive list) of the computer-readablemedium would include the following: an electrical connection(electronic) having one or more wires, a portable computer diskette(magnetic or optical), a random access memory (RAM) (electronic), aread-only memory (ROM) (electronic), an erasable programmable read-onlymemory (EPROM, EEPROM, or Flash memory) (electronic), an optical fiber(optical), and a portable compact disc memory (CDROM, CD R/W) (optical).Note that the computer-readable medium could even be paper or anothersuitable medium, upon which the program is printed or punched (as inpaper tape, punched cards, etc.), as the program can be electronicallycaptured, via for instance optical scanning of the paper or othermedium, then compiled, interpreted or otherwise processed in a suitablemanner if necessary, and then stored in a computer memory.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

In an alternative embodiment, where the system 100 is implemented inhardware, the system 100 can be implemented with any one or acombination of the following technologies, which are each well known inthe art: a discrete logic circuit(s) having logic gates for implementinglogic functions upon data signals, an application specific integratedcircuit (ASIC) having appropriate combinational logic gates, aprogrammable gate array(s) (PGA), a field programmable gate array(FPGA), etc.

The remote devices 15 and 17-20 provide access to the system 100 of thepresent invention on server 11 and database 12 using for example, butnot limited to an Internet browser. The information accessed in server11 and database 12 can be provided in a number of different formsincluding but not limited to ASCII data, WEB page data (i.e., HTML), XMLor other type of formatted data.

As illustrated, the remote devices 15 and 17-20 are similar to thedescription of the components for server 11 described with regard toFIG. 2. The remote devices 15 and 17-20 are referred to as remotedevices 15 for the sake of brevity.

Aspects of the present invention are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

According to an embodiment of the invention, an entity variantgeneration and normalization process implemented by the system 100comprises determining entity variants of an entity in a query by parsinga mention of an entity into semantic components. In one example,semantic components may be determined via domain ontology. In oneexample, the parsing is based on the type of entity and auxiliaryinformation. In one example, parsing can also be based on (influencedby) user configuration.

In one embodiment, variants for each of the semantic components aregenerated. The entity is recomposed in different morphological formsfrom the different variants of the semantic components. In one example,auxiliary information may comprise common dictionaries, such as stopword lists, prefix lists, antecedent words list, etc. Different semanticcomponents can be included or excluded when combining the differentvariants.

FIG. 3 shows an implementation of the system 100 for supportingknowledge-rich intelligent programmable entity variance generation andnormalization, according to an embodiment of the invention. The system100 includes a parsing module 101 for receiving an entity record 102Aand the associated entity type 102B. The parsing module 101 utilizessystem-predefined and/or user supplied auxiliary information 102C toparse the entity 102A into semantic components 102D based on auxiliaryinformation and the entity type.

A variant generating module 103 generates variants 102E for theindividual semantic components. A variant composition module 104composes the variants together into results 102F comprising completeentity forms, or one normalized form, based on user configurationinformation 105. In FIG. 3, E is a mention of an entity, “type” is theentity type associated with the mention, C_(i) is a semantic componentof E, Ci′ is a variant of Ci, and E′ is a variant of E.

FIG. 4 shows an example process 200 implemented by the system 100 forentity variance generation based on an example input entity record(e.g., textual query), according to an embodiment of the invention.Given an entity record instance (e.g., “IBM UK Ltd.”) and the entitytype associated with the record (e.g., “Company”), in process block 201the entity record is parsed into different semantic components based onthe given entity type. The possible semantic components for each entitytype may be obtained via domain ontology and influenced by optional userconfiguration. For example, according to domain ontology a company namemay be composed of <prefix>? <companyname><location>?<suffix>?<headquarter location>?<subsidiary name>?.Furthermore, a user may specify that none of the company names containsa subsidiary name.

The parsing process may refer to auxiliary information available. Forthe example illustrated in FIG. 4, “companyPrefix.dict” may be used as adictionary of common prefixes in company names such as “Bank of”, while“CompanySuffix.dict” may be used as a dictionary of common suffixes incompany names such as “Ltd.”, “Inc.” or “Limited.” The auxiliaryinformation is typically not required but may facilitate the parsingprocess if specified. In the example illustrated in FIG. 4, “IBM” isobtained as an instance of <company name>, “UK” as an instance of<location>, and “Ltd.” as an instance of <suffix>.

In process block 202, based on user configuration (and additionalauxiliary information, if any), variants are generated for each of thesemantic component instances. For example, with the information from“AbbrevMapping.dict”, the abbreviation “IBM” can be expanded into itsfull form “International Business Machines”. Similarly, with theinformation from “SuffixWithDotMapping.dict” 102G, the abbreviation“Ltd.” can be expanded into its full form “Limited”. The actual variantsgenerated depend on the user configuration. For the example in FIG. 4,only the instances of <location> and <suffix> are expanded into theirfull forms. Further, the abbreviation for an instance of <suffix> isrequired to include a “.” at its end. Therefore, “Ltd” is not generatedas a variant for “Ltd.”.

After all the variants for all the semantic components have beengenerated, in process 203 the variants are composed together intodifferent morphological forms of the original entity record instancebased on the user configuration. For example, if the user configurationrequires all the semantic components be present in the entity variants,then “IBM UK Ltd.”, “IBM UK Limited”, “IBM United Kingdom Ltd.” and “IBMUnited Kingdom Limited” are generated as variants. If the userconfiguration forbids the inclusion of the <location> componentinstances, then only “IBM Ltd.” and “IBM Limited” are generated as thevariants.

According to embodiments of the invention, entity variants are generatedin a semantically meaningful fashion. Entity variants are fullyprogrammable by user configuration and user provided auxiliaryinformation. An implementation of the invention can be seamlesslyintegrated with the indexing pipeline of an existing search applicationand/or its final result presentation pipeline.

FIG. 5 shows a normalization process 300, according to an embodiment ofthe invention. Employing different user configurations for both semanticcomponent variant generation and composition, embodiments of theinvention obtain normalization functionality.

Given an entity record instance (e.g., “IBM UK Ltd.”) and the entitytype associated with the record (e.g., “Company”), in process block 301the entity record is parsed into different semantic components based onthe given entity type. The possible semantic components for each entitytype may be obtained via domain ontology. For example, a company namemay be composed of <prefix>?<companyname><location>?<suffix>?<headquarter location>?<subsidiary name>?.

The parsing process may refer to auxiliary information available. Forthe example illustrated in FIG. 5, “companyPrefix.dict” may be used as adictionary of common prefixes in company names such as “Bank of”, while“CompanySuffix.dict” may be used as a dictionary of common suffixes incompany names such as “Ltd.”, “Inc.” or “Limited.” The auxiliaryinformation is typically not required but may facilitate the parsingprocess if specified. In the example illustrated in FIG. 5, “IBM” isobtained as an instance of <company name>, “UK” as an instance of<location>, and “Ltd.” as an instance of <suffix>.

In process block 302, based on user configuration 105 (and additionalauxiliary information, if any), variants are generated for each of thesemantic component instances. For example, with the information from“AbbrevMapping.dict”, the abbreviation “IBM” can be expanded into itsfull form “International Business Machines”. Similarly, with theinformation from “SuffixWithDotMapping.dict”, the abbreviation “Ltd.”can be expanded into its full form “Limited”. The actual variantsgenerated depend on the user configuration. For the example in FIG. 5,only the instances of <location> and <suffix> are expanded into theirfull forms. Further, the abbreviation for an instance of <suffix> isrequired to include a “.” at its end. Therefore, “Ltd” is not generatedas a variant for “Ltd.”.

After the variants for the semantic components have been generated, inprocess 303 the variants are composed together into a normalized form ofthe original entity record instance based on the user configuration. Forexample, based on a user configuration that requires certain semanticcomponents be present in the entity variants, then “IBM United KingdomLimited” is generated as a variant.

According to embodiments of the invention, when search results (e.g.,results 102F) are presented to the user, the results found for differentmorphological forms of the same entity are grouped together.

Further, according to embodiments of the invention, in searchapplications, facets may be generated on the fly to help the user refinethe query. Instead of overwhelming the user with many variant forms, thenormalization capability of this invention can be used to present to theuser a single normalized form (e.g., one facet in normalized form ispresented to the user for the different morphological forms of the sameentity record). A search application according to an embodiment of theinvention recognizes both the existence of morphological forms andnormalizes them into one form. A search application such as searchengines utilizing embodiments of the invention handles morphologicalforms for an entity for both search and result presentation.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components, and/or groups thereof.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

It should be emphasized that the above-described embodiments of thepresent invention, particularly, any “preferred” embodiments, are merelypossible examples of implementations, merely set forth for a clearunderstanding of the principles of the invention.

Many variations and modifications may be made to the above-describedembodiment(s) of the invention without departing substantially from thespirit and principles of the invention. All such modifications andvariations are intended to be included herein within the scope of thisdisclosure and the present invention and protected by the followingclaims.

What is claimed is:
 1. A method for providing search results for asearch query, comprising: receiving a search query including an entityand entity type; parsing the entity into semantic components; generatingvariants based on input from auxiliary information and userconfiguration information for each of the semantic components;recomposing the entity in different morphological forms from differentvariants of the semantic components; and presenting at least onemorphological form for the entity as a search result.
 2. The method ofclaim 1, wherein the at least one morphological form comprises a singlenormalized form for the different morphological forms.
 3. The method ofclaim 1, wherein facets are generated dynamically to assist refining thesearch query.
 4. The method of claim 1, wherein based on type of entity,different semantic components for each entity type are determined basedon domain ontology and the user configuration information.
 5. The methodof claim 1, further comprising: parsing based on the entity type;determining semantic components utilizing domain ontology; andrecomposing the entity by selectively including different semanticcomponents for combining the different variants of the semanticcomponents.
 6. The method of claim 1, further comprising recomposing theentity by selectively excluding different semantic components forcombining the different variants of the semantic components.
 7. Themethod of claim 1, wherein parsing further comprises parsing based onthe entity type and auxiliary information.
 8. A computer program productfor providing search results for a search query, the computer programproduct comprising a non-transitory computer readable storage mediumhaving instructions embodied therewith, the program instructionsexecutable by a computer to cause the computer to: receive, by thecomputer, a search query including an entity and entity type; parse, bythe computer, the entity into semantic components; generate, by thecomputer, variants based on input from auxiliary information and userconfiguration information for each of the semantic components;recompose, by the computer, the entity in different morphological formsfrom different variants of the semantic components; and present, by thecomputer, at least one morphological form for the entity as a searchresult.
 9. The computer program product of claim 8, wherein the at leastone morphological form comprises a single normalized form for thedifferent morphological forms.
 10. The computer program product of claim8, wherein facets are generated dynamically to assist refining thesearch query.
 11. The computer program product of claim 8, wherein basedon the entity type, different semantic components for each entity typeare determined based on domain ontology and the user configurationinformation.
 12. The computer program product of claim 8, furthercomprising program instructions executable by the computer to cause thecomputer to: parse, by the computer, based on the entity type;determine, by the computer, semantic components utilizing domainontology; and recompose, by the computer, the entity by selectivelyincluding different semantic components for combining the differentvariants of the semantic components.
 13. The computer program product ofclaim 8, further comprising program instructions executable by thecomputer to cause the computer to: recompose, by the computer, theentity by selectively excluding different semantic components forcombining the different variants of the semantic components.
 14. Thecomputer program product of claim 8, wherein parse, by the computer,comprises parsing based on the entity type and auxiliary information.15. A search query computing system, comprising: an interface thatreceives a search query including an entity and entity type; a parserthat parses the entity into semantic components based on the entitytype; a variant generator that generates variants based on input fromauxiliary information and user configuration information for each of thesemantic components; and a composer that recomposes the entity indifferent morphological forms from different variants of the semanticcomponents; wherein at least one morphological form for the entity ispresented as a search result.
 16. The search query computing system ofclaim 15, wherein the at least one morphological form comprises a singlenormalized form for the different morphological forms.
 17. The searchquery computing system of claim 15, wherein facets are generateddynamically to assist refining the search query.
 18. The search querycomputing system of claim 15, wherein based on entity type, differentsemantic components for each entity type are determined based on domainontology and the user configuration information.
 19. The search querycomputing system of claim 15, wherein: the parser parses based on theentity type; the variant generator determines semantic componentsutilizing domain ontology; and the composer recomposes the entity byselectively including different semantic components for combining thedifferent variants of the semantic components.
 20. The search querycomputing system of claim 15, wherein: the composer recomposes theentity by selectively excluding different semantic components forcombining the different variants of the semantic components; and theparser further parses based on the entity type and auxiliaryinformation.